Euclideaness and Final Polynomials in Oriented Matroid Theory
نویسنده
چکیده
This paper deals with a geometric construction of algebraic non-realizability proofs for certain oriented matroids. As main result we obtain an algorithm which generates a (bi-quadratic) final polynomial [3], [5] for any non-euclidean oriented matroid. Here we apply the results of Edmonds, Fukuda and Mandel [6], [7] concerning non-degenerate cycling of linear programms in non-euclidean oriented matroids.
منابع مشابه
Every non-Euclidean oriented matroid admits a biquadratic final polynomial
Richter-Gebert proved that every non-Euclidean uniform oriented matroid admits a biquadratic final polynomial. We extend this result to the non-uniform case.
متن کاملToward a Connection between the Oriented Matroid Theory and Supersymmetry
We considered the possibility that the oriented matroid theory is connected with supersymmetry via the Grassmann-Plucker relations. The main reason for this, is that such relations arise in both in the chirotopes definition of an oriented matroid, and in maximally supersymmetric solutions of elevenand ten-dimensional supergravity theories. Taking this observation as a motivation, and using the ...
متن کاملTotal Polynomials of Uniform Oriented Matroids
In this paper we introduce polynomials associated with uniform oriented matroids whose coefficients enumerate cells in the corresponding arrangements. These polynomials are quite useful in the study of many enumeration problems of combinatorial geometry, such as counting faces of polytopes, counting Radon partitions, counting k-sets, and so forth. We also describe some striking equations relati...
متن کاملA generalization of weight polynomials to matroids
Generalizing polynomials previously studied in the context of linear codes, we define weight polynomials and an enumerator for a matroid M . Our main result is that these polynomials are determined by Betti numbers associated with N0-graded minimal free resolutions of the Stanley-Reisner ideals of M and so-called elongations of M . Generalizing Greene’s theorem from coding theory, we show that ...
متن کاملThe Kazhdan-Lusztig polynomial of a matroid
We associate to every matroid M a polynomial with integer coefficients, which we call the Kazhdan-Lusztig polynomial of M , in analogy with Kazhdan-Lusztig polynomials in representation theory. We conjecture that the coefficients are always non-negative, and we prove this conjecture for representable matroids by interpreting our polynomials as intersection cohomology Poincaré polynomials. We al...
متن کامل